Paradoxes with Dice and Elections

نویسنده

  • Marcel Jackson
چکیده

There are two players playing the game, player U and player I. Each player chooses a (distinct) die and rolls – the player with the higher value is the winner. I kindly gives player U the first choice of any one of the three dice. Let us say that U chooses die X. After some thought, I chooses die Z, and then both players roll their dice. What are the possibilities? Because both dice have 6 sides there are 6 × 6 = 36 possibilities, however because of repetitions in the labeling of the dice, many of these outcomes are indistinguishable. In Table 2, the columns are labeled by the six faces values of die X and the rows by the face values of die Z. In a row with Z face value z and X face value x, we have put a Z if z > x and an X if x > z , in other words, the X’s and Z’s in the content of the table correspond to possible wins by the respective dice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dice games and Arrows theorem

We observe that non-transitivity is not the most general way that Arrow’s impossibility theorem is re‡ected in dice games. Non-transitivity in dice games is a well-known phenomenon. It was described in several Scienti…c American columns in the 1970s, beginning with [3], and has since become a popular topic, discussed in articles like [4, 5] and textbooks on elementary mathematics and probabilit...

متن کامل

The likelihood of monotonicity paradoxes in run-off elections

A monotonicity paradox occurs when a voting system reacts in a perverse way to a change in individual opinions. The vulnerability of a voting system to monotonicity paradoxes is defined as the proportion of voting situations that can give rise to such paradoxes. In this paper we provide analytical representations of this vulnerability in the three-alternative case for two voting systems, i.e. p...

متن کامل

Paradoxes of Multiple Elections: An Approximation Approach

When agents need to make decisions on multiple issues, applying common voting rules becomes computationally hard due to the exponentially large number of alternatives. One computationally efficient solution is to vote on the issues sequentially. In this paper, we investigate how well the winner under the sequential voting process approximates the winners under some common voting rules that admi...

متن کامل

The Challenges of the Elections Systems of Persian Gulf Arab Countries

This article intends to clarify views regarding important challenges that have originated from the political, social, cultural and geopolitical structures in the elections systems of Persian Gulf Arab countries. Challenges that determine the compatibility levels of elections systems of these countries with the world’s democratic systems. An efficient elections system is the prerequisite for the...

متن کامل

Understanding Voting for Committees Using Wreath Products

In this thesis, we construct an algebraic framework for analyzing committee elections. In this framework, module homomorphisms are used to model positional voting procedures. Using the action of the wreath product group S2[Sn] on these modules, we obtain module decompositions which help us to gain an understanding of the module homomorphism. We use these decompositions to construct some interes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005